./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_valuebound1.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5189fb62 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_valuebound1.c -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a2e0d3ed79ba62190a0b501c090bc81fd178363cb7e6ce8cbe0996ce655e2ac6 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-5189fb6-m [2024-09-12 23:33:29,447 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-12 23:33:29,521 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-12 23:33:29,525 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-12 23:33:29,526 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-12 23:33:29,560 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-12 23:33:29,561 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-12 23:33:29,561 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-12 23:33:29,561 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-12 23:33:29,562 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-12 23:33:29,562 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-12 23:33:29,562 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-12 23:33:29,563 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-12 23:33:29,563 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-12 23:33:29,563 INFO L153 SettingsManager]: * Use SBE=true [2024-09-12 23:33:29,564 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-12 23:33:29,566 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-12 23:33:29,568 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-12 23:33:29,568 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-12 23:33:29,569 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-12 23:33:29,569 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-12 23:33:29,569 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-12 23:33:29,569 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-12 23:33:29,570 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-12 23:33:29,570 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-12 23:33:29,570 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-12 23:33:29,570 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-12 23:33:29,571 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-12 23:33:29,571 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-12 23:33:29,571 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-12 23:33:29,571 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-12 23:33:29,572 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-12 23:33:29,572 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 23:33:29,575 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-12 23:33:29,575 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-12 23:33:29,575 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-12 23:33:29,575 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-12 23:33:29,575 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-12 23:33:29,576 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-12 23:33:29,576 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-12 23:33:29,576 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-12 23:33:29,576 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-12 23:33:29,577 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/certificate-witnesses-artifact/automizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/certificate-witnesses-artifact/automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a2e0d3ed79ba62190a0b501c090bc81fd178363cb7e6ce8cbe0996ce655e2ac6 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 [2024-09-12 23:33:29,822 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-12 23:33:29,843 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-12 23:33:29,846 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-12 23:33:29,847 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-12 23:33:29,847 INFO L274 PluginConnector]: CDTParser initialized [2024-09-12 23:33:29,848 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_valuebound1.c [2024-09-12 23:33:31,188 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-12 23:33:31,381 INFO L384 CDTParser]: Found 1 translation units. [2024-09-12 23:33:31,382 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_valuebound1.c [2024-09-12 23:33:31,391 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/bbd9a3fbf/1106800808564924a4d82823ba3f77b6/FLAGdf1ee2c94 [2024-09-12 23:33:31,402 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/bbd9a3fbf/1106800808564924a4d82823ba3f77b6 [2024-09-12 23:33:31,403 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-12 23:33:31,404 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-12 23:33:31,407 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-12 23:33:31,407 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-12 23:33:31,410 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-12 23:33:31,411 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 11:33:31" (1/1) ... [2024-09-12 23:33:31,411 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e26075c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 11:33:31, skipping insertion in model container [2024-09-12 23:33:31,412 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 11:33:31" (1/1) ... [2024-09-12 23:33:31,429 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-12 23:33:31,582 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_valuebound1.c[525,538] [2024-09-12 23:33:31,622 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 23:33:31,634 INFO L200 MainTranslator]: Completed pre-run [2024-09-12 23:33:31,646 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_valuebound1.c[525,538] [2024-09-12 23:33:31,661 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 23:33:31,676 INFO L204 MainTranslator]: Completed translation [2024-09-12 23:33:31,677 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 11:33:31 WrapperNode [2024-09-12 23:33:31,677 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-12 23:33:31,678 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-12 23:33:31,678 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-12 23:33:31,679 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-12 23:33:31,685 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 11:33:31" (1/1) ... [2024-09-12 23:33:31,694 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 11:33:31" (1/1) ... [2024-09-12 23:33:31,701 INFO L138 Inliner]: procedures = 14, calls = 18, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-12 23:33:31,702 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-12 23:33:31,702 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-12 23:33:31,702 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-12 23:33:31,703 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-12 23:33:31,713 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 11:33:31" (1/1) ... [2024-09-12 23:33:31,713 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 11:33:31" (1/1) ... [2024-09-12 23:33:31,715 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 11:33:31" (1/1) ... [2024-09-12 23:33:31,729 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-09-12 23:33:31,730 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 11:33:31" (1/1) ... [2024-09-12 23:33:31,730 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 11:33:31" (1/1) ... [2024-09-12 23:33:31,733 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 11:33:31" (1/1) ... [2024-09-12 23:33:31,738 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 11:33:31" (1/1) ... [2024-09-12 23:33:31,742 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 11:33:31" (1/1) ... [2024-09-12 23:33:31,742 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 11:33:31" (1/1) ... [2024-09-12 23:33:31,744 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-12 23:33:31,747 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-12 23:33:31,747 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-12 23:33:31,747 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-12 23:33:31,748 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 11:33:31" (1/1) ... [2024-09-12 23:33:31,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 23:33:31,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 23:33:31,779 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-12 23:33:31,781 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-12 23:33:31,824 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-12 23:33:31,825 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-12 23:33:31,826 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-12 23:33:31,826 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-12 23:33:31,826 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-12 23:33:31,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-12 23:33:31,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-12 23:33:31,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-12 23:33:31,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-12 23:33:31,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-12 23:33:31,828 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-12 23:33:31,829 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-12 23:33:31,888 INFO L242 CfgBuilder]: Building ICFG [2024-09-12 23:33:31,890 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-12 23:33:32,140 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-09-12 23:33:32,141 INFO L291 CfgBuilder]: Performing block encoding [2024-09-12 23:33:32,164 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-12 23:33:32,165 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-12 23:33:32,165 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 11:33:32 BoogieIcfgContainer [2024-09-12 23:33:32,166 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-12 23:33:32,168 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-12 23:33:32,168 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-12 23:33:32,170 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-12 23:33:32,171 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.09 11:33:31" (1/3) ... [2024-09-12 23:33:32,172 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@173d395 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 11:33:32, skipping insertion in model container [2024-09-12 23:33:32,172 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 11:33:31" (2/3) ... [2024-09-12 23:33:32,172 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@173d395 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 11:33:32, skipping insertion in model container [2024-09-12 23:33:32,173 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 11:33:32" (3/3) ... [2024-09-12 23:33:32,174 INFO L112 eAbstractionObserver]: Analyzing ICFG dijkstra-u_valuebound1.c [2024-09-12 23:33:32,189 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-12 23:33:32,189 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-12 23:33:32,246 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-12 23:33:32,252 INFO L336 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@783cd042, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-12 23:33:32,252 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-12 23:33:32,256 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-09-12 23:33:32,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-12 23:33:32,263 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 23:33:32,264 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 23:33:32,265 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 23:33:32,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 23:33:32,270 INFO L85 PathProgramCache]: Analyzing trace with hash 570623365, now seen corresponding path program 1 times [2024-09-12 23:33:32,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 23:33:32,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860069301] [2024-09-12 23:33:32,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 23:33:32,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 23:33:32,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:33:32,408 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 23:33:32,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:33:32,420 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 23:33:32,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:33:32,430 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 23:33:32,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:33:32,441 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-12 23:33:32,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 23:33:32,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860069301] [2024-09-12 23:33:32,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860069301] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 23:33:32,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 23:33:32,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-12 23:33:32,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568112723] [2024-09-12 23:33:32,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 23:33:32,455 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-12 23:33:32,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 23:33:32,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-12 23:33:32,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-12 23:33:32,476 INFO L87 Difference]: Start difference. First operand has 36 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-12 23:33:32,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 23:33:32,500 INFO L93 Difference]: Finished difference Result 66 states and 110 transitions. [2024-09-12 23:33:32,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-12 23:33:32,504 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2024-09-12 23:33:32,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 23:33:32,509 INFO L225 Difference]: With dead ends: 66 [2024-09-12 23:33:32,509 INFO L226 Difference]: Without dead ends: 32 [2024-09-12 23:33:32,512 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-12 23:33:32,515 INFO L434 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 23:33:32,516 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 23:33:32,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-09-12 23:33:32,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-09-12 23:33:32,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-09-12 23:33:32,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2024-09-12 23:33:32,555 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 43 transitions. Word has length 22 [2024-09-12 23:33:32,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 23:33:32,555 INFO L474 AbstractCegarLoop]: Abstraction has 32 states and 43 transitions. [2024-09-12 23:33:32,556 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-12 23:33:32,556 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 23:33:32,557 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2024-09-12 23:33:32,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-09-12 23:33:32,558 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 23:33:32,558 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 23:33:32,558 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-12 23:33:32,559 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 23:33:32,559 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 23:33:32,559 INFO L85 PathProgramCache]: Analyzing trace with hash -2095105318, now seen corresponding path program 1 times [2024-09-12 23:33:32,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 23:33:32,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125201375] [2024-09-12 23:33:32,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 23:33:32,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 23:33:32,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:33:33,102 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 23:33:33,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:33:33,111 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 23:33:33,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:33:33,118 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 23:33:33,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:33:33,121 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-12 23:33:33,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 23:33:33,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125201375] [2024-09-12 23:33:33,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125201375] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 23:33:33,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 23:33:33,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-12 23:33:33,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056979538] [2024-09-12 23:33:33,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 23:33:33,124 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 23:33:33,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 23:33:33,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 23:33:33,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-12 23:33:33,125 INFO L87 Difference]: Start difference. First operand 32 states and 43 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-12 23:33:34,335 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 23:33:38,402 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 23:33:38,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 23:33:38,427 INFO L93 Difference]: Finished difference Result 64 states and 92 transitions. [2024-09-12 23:33:38,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 23:33:38,428 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2024-09-12 23:33:38,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 23:33:38,429 INFO L225 Difference]: With dead ends: 64 [2024-09-12 23:33:38,430 INFO L226 Difference]: Without dead ends: 46 [2024-09-12 23:33:38,430 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-12 23:33:38,432 INFO L434 NwaCegarLoop]: 42 mSDtfsCounter, 5 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 13 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2024-09-12 23:33:38,432 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 184 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 53 Invalid, 1 Unknown, 0 Unchecked, 5.2s Time] [2024-09-12 23:33:38,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-09-12 23:33:38,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-09-12 23:33:38,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-09-12 23:33:38,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 63 transitions. [2024-09-12 23:33:38,460 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 63 transitions. Word has length 23 [2024-09-12 23:33:38,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 23:33:38,461 INFO L474 AbstractCegarLoop]: Abstraction has 46 states and 63 transitions. [2024-09-12 23:33:38,461 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-12 23:33:38,461 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 23:33:38,461 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 63 transitions. [2024-09-12 23:33:38,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-09-12 23:33:38,464 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 23:33:38,465 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 23:33:38,465 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-12 23:33:38,465 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 23:33:38,465 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 23:33:38,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1429886677, now seen corresponding path program 1 times [2024-09-12 23:33:38,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 23:33:38,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778334473] [2024-09-12 23:33:38,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 23:33:38,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 23:33:38,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:33:38,873 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 23:33:38,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:33:38,879 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 23:33:38,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:33:38,884 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 23:33:38,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:33:38,890 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-12 23:33:38,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 23:33:38,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778334473] [2024-09-12 23:33:38,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778334473] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 23:33:38,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [980963324] [2024-09-12 23:33:38,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 23:33:38,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 23:33:38,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 23:33:38,899 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 23:33:38,902 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-12 23:33:38,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:33:38,957 INFO L262 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-12 23:33:38,966 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 23:33:39,147 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-12 23:33:39,147 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 23:33:39,348 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-12 23:33:39,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [980963324] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 23:33:39,350 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 23:33:39,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2024-09-12 23:33:39,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299922567] [2024-09-12 23:33:39,350 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 23:33:39,351 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-09-12 23:33:39,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 23:33:39,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-09-12 23:33:39,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2024-09-12 23:33:39,353 INFO L87 Difference]: Start difference. First operand 46 states and 63 transitions. Second operand has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 13 states have internal predecessors, (28), 4 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-12 23:33:41,942 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 23:33:45,988 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 23:33:50,032 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 23:33:54,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 23:33:58,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 23:33:59,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 23:33:59,705 INFO L93 Difference]: Finished difference Result 137 states and 220 transitions. [2024-09-12 23:33:59,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-12 23:33:59,706 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 13 states have internal predecessors, (28), 4 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2024-09-12 23:33:59,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 23:33:59,709 INFO L225 Difference]: With dead ends: 137 [2024-09-12 23:33:59,709 INFO L226 Difference]: Without dead ends: 119 [2024-09-12 23:33:59,710 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2024-09-12 23:33:59,711 INFO L434 NwaCegarLoop]: 52 mSDtfsCounter, 23 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 137 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.1s IncrementalHoareTripleChecker+Time [2024-09-12 23:33:59,711 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 398 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 291 Invalid, 4 Unknown, 0 Unchecked, 20.1s Time] [2024-09-12 23:33:59,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-09-12 23:33:59,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 71. [2024-09-12 23:33:59,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 38 states have (on average 1.263157894736842) internal successors, (48), 41 states have internal predecessors, (48), 27 states have call successors, (27), 6 states have call predecessors, (27), 5 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2024-09-12 23:33:59,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 100 transitions. [2024-09-12 23:33:59,744 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 100 transitions. Word has length 25 [2024-09-12 23:33:59,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 23:33:59,745 INFO L474 AbstractCegarLoop]: Abstraction has 71 states and 100 transitions. [2024-09-12 23:33:59,745 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 13 states have internal predecessors, (28), 4 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-12 23:33:59,745 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 23:33:59,746 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 100 transitions. [2024-09-12 23:33:59,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-09-12 23:33:59,747 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 23:33:59,747 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 23:33:59,765 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-09-12 23:33:59,951 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 23:33:59,952 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 23:33:59,953 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 23:33:59,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1189191834, now seen corresponding path program 1 times [2024-09-12 23:33:59,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 23:33:59,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524059769] [2024-09-12 23:33:59,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 23:33:59,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 23:33:59,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-12 23:33:59,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [307743913] [2024-09-12 23:33:59,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 23:33:59,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 23:33:59,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 23:33:59,996 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 23:33:59,997 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-12 23:34:00,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:34:00,043 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-12 23:34:00,045 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 23:34:00,095 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-12 23:34:00,095 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 23:34:00,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 23:34:00,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524059769] [2024-09-12 23:34:00,096 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-12 23:34:00,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307743913] [2024-09-12 23:34:00,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [307743913] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 23:34:00,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 23:34:00,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 23:34:00,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883970671] [2024-09-12 23:34:00,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 23:34:00,098 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 23:34:00,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 23:34:00,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 23:34:00,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 23:34:00,099 INFO L87 Difference]: Start difference. First operand 71 states and 100 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-12 23:34:00,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 23:34:00,248 INFO L93 Difference]: Finished difference Result 98 states and 139 transitions. [2024-09-12 23:34:00,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 23:34:00,249 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2024-09-12 23:34:00,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 23:34:00,251 INFO L225 Difference]: With dead ends: 98 [2024-09-12 23:34:00,251 INFO L226 Difference]: Without dead ends: 95 [2024-09-12 23:34:00,252 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-12 23:34:00,254 INFO L434 NwaCegarLoop]: 39 mSDtfsCounter, 5 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 23:34:00,255 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 138 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 23:34:00,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-09-12 23:34:00,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-09-12 23:34:00,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 50 states have internal predecessors, (58), 40 states have call successors, (40), 8 states have call predecessors, (40), 7 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2024-09-12 23:34:00,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 135 transitions. [2024-09-12 23:34:00,279 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 135 transitions. Word has length 33 [2024-09-12 23:34:00,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 23:34:00,280 INFO L474 AbstractCegarLoop]: Abstraction has 95 states and 135 transitions. [2024-09-12 23:34:00,280 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-12 23:34:00,280 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 23:34:00,281 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 135 transitions. [2024-09-12 23:34:00,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-09-12 23:34:00,281 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 23:34:00,282 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 23:34:00,298 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-09-12 23:34:00,485 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 23:34:00,486 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 23:34:00,486 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 23:34:00,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1682280212, now seen corresponding path program 1 times [2024-09-12 23:34:00,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 23:34:00,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690893554] [2024-09-12 23:34:00,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 23:34:00,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 23:34:00,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:34:00,619 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 23:34:00,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:34:00,622 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 23:34:00,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:34:00,650 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 23:34:00,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:34:00,654 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-12 23:34:00,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:34:00,656 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-12 23:34:00,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 23:34:00,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690893554] [2024-09-12 23:34:00,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690893554] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 23:34:00,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928131881] [2024-09-12 23:34:00,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 23:34:00,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 23:34:00,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 23:34:00,659 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 23:34:00,660 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-12 23:34:00,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:34:00,708 INFO L262 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-12 23:34:00,709 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 23:34:00,781 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-12 23:34:00,781 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 23:34:00,909 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-12 23:34:00,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928131881] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 23:34:00,910 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 23:34:00,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2024-09-12 23:34:00,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175069770] [2024-09-12 23:34:00,910 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 23:34:00,911 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-12 23:34:00,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 23:34:00,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-12 23:34:00,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-09-12 23:34:00,912 INFO L87 Difference]: Start difference. First operand 95 states and 135 transitions. Second operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 10 states have internal predecessors, (34), 4 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-09-12 23:34:02,509 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 23:34:03,675 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 23:34:03,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 23:34:03,711 INFO L93 Difference]: Finished difference Result 124 states and 171 transitions. [2024-09-12 23:34:03,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-12 23:34:03,712 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 10 states have internal predecessors, (34), 4 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 32 [2024-09-12 23:34:03,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 23:34:03,713 INFO L225 Difference]: With dead ends: 124 [2024-09-12 23:34:03,713 INFO L226 Difference]: Without dead ends: 78 [2024-09-12 23:34:03,714 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2024-09-12 23:34:03,714 INFO L434 NwaCegarLoop]: 47 mSDtfsCounter, 28 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-09-12 23:34:03,715 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 320 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-09-12 23:34:03,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-09-12 23:34:03,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 75. [2024-09-12 23:34:03,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 34 states have (on average 1.088235294117647) internal successors, (37), 37 states have internal predecessors, (37), 33 states have call successors, (33), 8 states have call predecessors, (33), 7 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-09-12 23:34:03,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 100 transitions. [2024-09-12 23:34:03,739 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 100 transitions. Word has length 32 [2024-09-12 23:34:03,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 23:34:03,740 INFO L474 AbstractCegarLoop]: Abstraction has 75 states and 100 transitions. [2024-09-12 23:34:03,740 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 10 states have internal predecessors, (34), 4 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-09-12 23:34:03,740 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 23:34:03,741 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 100 transitions. [2024-09-12 23:34:03,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-09-12 23:34:03,743 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 23:34:03,744 INFO L216 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 23:34:03,760 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-12 23:34:03,944 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 23:34:03,945 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 23:34:03,945 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 23:34:03,945 INFO L85 PathProgramCache]: Analyzing trace with hash -409333978, now seen corresponding path program 1 times [2024-09-12 23:34:03,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 23:34:03,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976724828] [2024-09-12 23:34:03,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 23:34:03,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 23:34:03,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-12 23:34:03,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [940764680] [2024-09-12 23:34:03,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 23:34:03,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 23:34:03,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 23:34:03,990 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 23:34:03,992 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-12 23:34:04,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:34:04,049 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-09-12 23:34:04,051 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 23:34:04,189 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 19 proven. 13 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-09-12 23:34:04,189 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 23:34:12,434 WARN L854 $PredicateComparison]: unable to prove that (or (= (mod (+ (* 4294967295 c_main_~n~0) c_main_~r~0 (* c_main_~p~0 c_main_~p~0)) 4294967296) 0) (forall ((main_~q~0 Int)) (not (= (mod (+ (* main_~q~0 main_~q~0 4294967295 c_main_~h~0) (* 4294967292 main_~q~0 main_~q~0 c_main_~p~0) (* main_~q~0 c_main_~r~0 12 c_main_~h~0) (* main_~q~0 16 c_main_~p~0 c_main_~n~0) (* c_main_~h~0 c_main_~h~0 c_main_~h~0) (* main_~q~0 c_main_~n~0 4294967284 c_main_~h~0) (* main_~q~0 c_main_~p~0 c_main_~r~0 4294967280)) 4294967296) 0)))) is different from false [2024-09-12 23:34:12,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 23:34:12,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976724828] [2024-09-12 23:34:12,441 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-12 23:34:12,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [940764680] [2024-09-12 23:34:12,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [940764680] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 23:34:12,441 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-09-12 23:34:12,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2024-09-12 23:34:12,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704640361] [2024-09-12 23:34:12,441 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-09-12 23:34:12,442 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-12 23:34:12,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 23:34:12,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-12 23:34:12,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=54, Unknown=1, NotChecked=14, Total=90 [2024-09-12 23:34:12,443 INFO L87 Difference]: Start difference. First operand 75 states and 100 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-09-12 23:34:12,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 23:34:12,767 INFO L93 Difference]: Finished difference Result 89 states and 114 transitions. [2024-09-12 23:34:12,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-12 23:34:12,769 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 59 [2024-09-12 23:34:12,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 23:34:12,770 INFO L225 Difference]: With dead ends: 89 [2024-09-12 23:34:12,770 INFO L226 Difference]: Without dead ends: 67 [2024-09-12 23:34:12,771 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=27, Invalid=66, Unknown=1, NotChecked=16, Total=110 [2024-09-12 23:34:12,771 INFO L434 NwaCegarLoop]: 28 mSDtfsCounter, 8 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-12 23:34:12,772 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 133 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-12 23:34:12,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-09-12 23:34:12,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-09-12 23:34:12,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 35 states have internal predecessors, (35), 26 states have call successors, (26), 8 states have call predecessors, (26), 7 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-09-12 23:34:12,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 84 transitions. [2024-09-12 23:34:12,799 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 84 transitions. Word has length 59 [2024-09-12 23:34:12,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 23:34:12,799 INFO L474 AbstractCegarLoop]: Abstraction has 67 states and 84 transitions. [2024-09-12 23:34:12,800 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-09-12 23:34:12,800 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 23:34:12,800 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 84 transitions. [2024-09-12 23:34:12,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-09-12 23:34:12,803 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 23:34:12,803 INFO L216 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 23:34:12,819 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-09-12 23:34:13,007 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 23:34:13,008 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 23:34:13,008 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 23:34:13,008 INFO L85 PathProgramCache]: Analyzing trace with hash 382001091, now seen corresponding path program 1 times [2024-09-12 23:34:13,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 23:34:13,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474704444] [2024-09-12 23:34:13,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 23:34:13,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 23:34:13,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:34:13,746 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 23:34:13,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:34:13,749 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 23:34:13,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:34:13,750 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 23:34:13,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:34:13,752 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-12 23:34:13,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:34:13,760 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-12 23:34:13,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:34:13,768 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-12 23:34:13,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:34:13,776 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-12 23:34:13,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:34:13,786 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-09-12 23:34:13,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:34:13,794 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-09-12 23:34:13,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:34:13,813 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-09-12 23:34:13,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 23:34:13,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474704444] [2024-09-12 23:34:13,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474704444] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 23:34:13,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [153973891] [2024-09-12 23:34:13,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 23:34:13,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 23:34:13,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 23:34:13,815 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 23:34:13,819 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-12 23:34:13,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:34:14,000 INFO L262 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-09-12 23:34:14,003 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 23:34:14,550 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 23 proven. 11 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-09-12 23:34:14,550 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 23:34:29,582 WARN L293 SmtUtils]: Spent 9.22s on a formula simplification that was a NOOP. DAG size: 46 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-12 23:34:40,759 WARN L293 SmtUtils]: Spent 10.96s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:35:00,871 WARN L293 SmtUtils]: Spent 20.09s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:35:13,107 WARN L293 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:35:29,465 WARN L293 SmtUtils]: Spent 12.08s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:35:58,059 WARN L293 SmtUtils]: Spent 20.19s on a formula simplification that was a NOOP. DAG size: 50 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-12 23:36:14,360 WARN L293 SmtUtils]: Spent 12.05s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:36:26,467 WARN L293 SmtUtils]: Spent 12.08s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:37:15,676 WARN L293 SmtUtils]: Spent 12.80s on a formula simplification that was a NOOP. DAG size: 50 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-12 23:37:23,883 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 23 proven. 8 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-09-12 23:37:23,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [153973891] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 23:37:23,883 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 23:37:23,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14, 12] total 27 [2024-09-12 23:37:23,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269318586] [2024-09-12 23:37:23,883 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 23:37:23,884 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-09-12 23:37:23,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 23:37:23,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-09-12 23:37:23,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=592, Unknown=8, NotChecked=0, Total=702 [2024-09-12 23:37:23,885 INFO L87 Difference]: Start difference. First operand 67 states and 84 transitions. Second operand has 27 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 22 states have internal predecessors, (47), 9 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (23), 8 states have call predecessors, (23), 7 states have call successors, (23) [2024-09-12 23:37:27,962 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 23:37:31,984 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 23:37:36,030 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 23:37:45,017 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 23:37:49,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 23:37:53,538 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 23:37:57,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 23:38:01,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 23:38:05,580 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 23:38:09,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 23:38:13,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 23:38:50,839 WARN L293 SmtUtils]: Spent 36.52s on a formula simplification that was a NOOP. DAG size: 70 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-12 23:38:54,984 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 23:38:58,996 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 23:39:03,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 23:39:07,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 23:39:11,143 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 23:39:15,503 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 23:39:17,467 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 23:39:18,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 23:39:18,812 INFO L93 Difference]: Finished difference Result 83 states and 98 transitions. [2024-09-12 23:39:18,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-12 23:39:18,813 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 22 states have internal predecessors, (47), 9 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (23), 8 states have call predecessors, (23), 7 states have call successors, (23) Word has length 58 [2024-09-12 23:39:18,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 23:39:18,814 INFO L225 Difference]: With dead ends: 83 [2024-09-12 23:39:18,814 INFO L226 Difference]: Without dead ends: 64 [2024-09-12 23:39:18,815 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 115 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 121.6s TimeCoverageRelationStatistics Valid=157, Invalid=890, Unknown=9, NotChecked=0, Total=1056 [2024-09-12 23:39:18,816 INFO L434 NwaCegarLoop]: 29 mSDtfsCounter, 12 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 52 mSolverCounterUnsat, 17 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 73.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 17 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 73.6s IncrementalHoareTripleChecker+Time [2024-09-12 23:39:18,817 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 386 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 428 Invalid, 17 Unknown, 0 Unchecked, 73.6s Time] [2024-09-12 23:39:18,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-09-12 23:39:18,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2024-09-12 23:39:18,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 35 states have internal predecessors, (35), 19 states have call successors, (19), 9 states have call predecessors, (19), 8 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-09-12 23:39:18,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 71 transitions. [2024-09-12 23:39:18,833 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 71 transitions. Word has length 58 [2024-09-12 23:39:18,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 23:39:18,834 INFO L474 AbstractCegarLoop]: Abstraction has 62 states and 71 transitions. [2024-09-12 23:39:18,834 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 22 states have internal predecessors, (47), 9 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (23), 8 states have call predecessors, (23), 7 states have call successors, (23) [2024-09-12 23:39:18,834 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 23:39:18,834 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 71 transitions. [2024-09-12 23:39:18,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-09-12 23:39:18,835 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 23:39:18,835 INFO L216 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 23:39:18,852 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-12 23:39:19,036 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-09-12 23:39:19,036 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 23:39:19,037 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 23:39:19,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1865017153, now seen corresponding path program 2 times [2024-09-12 23:39:19,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 23:39:19,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851859933] [2024-09-12 23:39:19,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 23:39:19,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 23:39:19,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-12 23:39:19,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [611959369] [2024-09-12 23:39:19,076 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-12 23:39:19,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 23:39:19,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 23:39:19,078 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 23:39:19,079 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-09-12 23:39:19,192 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-12 23:39:19,192 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 23:39:19,193 INFO L262 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-09-12 23:39:19,195 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 23:39:19,645 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 24 proven. 25 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-09-12 23:39:19,646 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 23:39:40,409 WARN L293 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-12 23:39:52,609 WARN L293 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:40:00,747 WARN L293 SmtUtils]: Spent 8.04s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:40:16,687 WARN L293 SmtUtils]: Spent 15.72s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:40:31,037 WARN L293 SmtUtils]: Spent 10.18s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:40:36,405 WARN L293 SmtUtils]: Spent 5.37s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:40:40,433 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (mod c_main_~q~0 4294967296))) (or (let ((.cse0 (div .cse2 4))) (= (mod (* c_main_~n~0 .cse0) 4294967296) (mod (let ((.cse1 (div (mod c_main_~p~0 4294967296) 2))) (+ (* c_main_~r~0 .cse0) (* .cse1 .cse1) (* 4294967295 c_main_~p~0 .cse0) (* 2 .cse1 .cse0))) 4294967296))) (not (= (mod (+ (* c_main_~q~0 c_main_~q~0 4294967295 c_main_~p~0) (* c_main_~q~0 c_main_~r~0 4 c_main_~h~0) (* c_main_~p~0 c_main_~h~0 c_main_~h~0) (* c_main_~q~0 c_main_~p~0 c_main_~n~0 4) (* 4294967292 c_main_~q~0 c_main_~p~0 c_main_~r~0) (* 4294967292 c_main_~q~0 c_main_~n~0 c_main_~h~0)) 4294967296) 0)) (= .cse2 1) (not (= (mod (* c_main_~q~0 c_main_~n~0) 4294967296) (mod (+ (* c_main_~q~0 c_main_~r~0) (* c_main_~p~0 c_main_~p~0)) 4294967296))))) is different from true [2024-09-12 23:40:50,761 WARN L293 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:41:02,876 WARN L293 SmtUtils]: Spent 12.11s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:41:19,002 WARN L293 SmtUtils]: Spent 16.12s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:41:27,977 WARN L293 SmtUtils]: Spent 5.58s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:41:42,261 WARN L293 SmtUtils]: Spent 12.12s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:41:48,093 WARN L293 SmtUtils]: Spent 5.83s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:41:56,228 WARN L293 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:42:10,354 WARN L293 SmtUtils]: Spent 9.59s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:43:17,442 WARN L293 SmtUtils]: Spent 43.15s on a formula simplification that was a NOOP. DAG size: 48 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-12 23:43:25,431 WARN L293 SmtUtils]: Spent 7.98s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:43:34,943 WARN L293 SmtUtils]: Spent 8.33s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:43:48,297 WARN L293 SmtUtils]: Spent 9.08s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:44:04,329 WARN L293 SmtUtils]: Spent 16.03s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:44:12,535 WARN L293 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:44:25,287 WARN L293 SmtUtils]: Spent 12.75s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:44:29,542 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~q~0 1073741824))) (or (not (= (mod (+ (* c_main_~q~0 c_main_~r~0 4) (* c_main_~p~0 c_main_~p~0)) 4294967296) (* (mod (* c_main_~q~0 c_main_~n~0) 1073741824) 4))) (not (= (mod (+ (* c_main_~q~0 c_main_~q~0 c_main_~p~0 4294967280) (* c_main_~q~0 c_main_~p~0 c_main_~r~0 4294967280) (* c_main_~q~0 c_main_~n~0 4294967280 c_main_~h~0) (* c_main_~q~0 16 c_main_~r~0 c_main_~h~0) (* c_main_~p~0 c_main_~h~0 c_main_~h~0) (* c_main_~q~0 16 c_main_~p~0 c_main_~n~0)) 4294967296) 0)) (< (* 4 .cse0) (+ (mod c_main_~n~0 4294967296) 1)) (= (mod (* c_main_~n~0 .cse0) 4294967296) (mod (let ((.cse1 (div (mod c_main_~p~0 4294967296) 2))) (+ (* .cse1 .cse1) (* 4294967295 c_main_~p~0 .cse0) (* c_main_~r~0 .cse0) (* 2 .cse1 .cse0))) 4294967296)))) is different from true [2024-09-12 23:44:40,568 WARN L293 SmtUtils]: Spent 10.13s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:44:47,417 WARN L293 SmtUtils]: Spent 6.85s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:44:55,782 WARN L293 SmtUtils]: Spent 8.36s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:44:55,799 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 24 proven. 20 refuted. 0 times theorem prover too weak. 58 trivial. 5 not checked. [2024-09-12 23:44:55,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 23:44:55,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851859933] [2024-09-12 23:44:55,799 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-12 23:44:55,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [611959369] [2024-09-12 23:44:55,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [611959369] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 23:44:55,799 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-12 23:44:55,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2024-09-12 23:44:55,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977350820] [2024-09-12 23:44:55,800 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-12 23:44:55,800 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-09-12 23:44:55,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 23:44:55,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-09-12 23:44:55,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=269, Unknown=7, NotChecked=70, Total=420 [2024-09-12 23:44:55,801 INFO L87 Difference]: Start difference. First operand 62 states and 71 transitions. Second operand has 21 states, 20 states have (on average 1.8) internal successors, (36), 17 states have internal predecessors, (36), 8 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (17), 8 states have call predecessors, (17), 8 states have call successors, (17) [2024-09-12 23:44:59,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2024-09-12 23:45:03,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 23:45:07,878 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 23:45:15,930 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 23:45:20,106 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 23:45:24,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 23:45:28,237 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 23:45:32,261 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 23:45:36,272 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 23:45:40,330 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 23:45:45,662 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.32s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 23:45:49,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 23:45:53,684 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 23:45:57,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 23:46:01,787 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 23:46:02,846 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 23:46:06,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 23:46:11,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 23:46:11,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 23:46:11,146 INFO L93 Difference]: Finished difference Result 68 states and 76 transitions. [2024-09-12 23:46:11,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-12 23:46:11,146 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.8) internal successors, (36), 17 states have internal predecessors, (36), 8 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (17), 8 states have call predecessors, (17), 8 states have call successors, (17) Word has length 63 [2024-09-12 23:46:11,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 23:46:11,147 INFO L225 Difference]: With dead ends: 68 [2024-09-12 23:46:11,147 INFO L226 Difference]: Without dead ends: 66 [2024-09-12 23:46:11,148 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 106 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 95.4s TimeCoverageRelationStatistics Valid=82, Invalid=298, Unknown=8, NotChecked=74, Total=462 [2024-09-12 23:46:11,148 INFO L434 NwaCegarLoop]: 33 mSDtfsCounter, 3 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 17 mSolverCounterUnsat, 17 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 71.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 17 IncrementalHoareTripleChecker+Unknown, 113 IncrementalHoareTripleChecker+Unchecked, 71.3s IncrementalHoareTripleChecker+Time [2024-09-12 23:46:11,148 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 279 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 271 Invalid, 17 Unknown, 113 Unchecked, 71.3s Time] [2024-09-12 23:46:11,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-09-12 23:46:11,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-09-12 23:46:11,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 37 states have (on average 1.027027027027027) internal successors, (38), 38 states have internal predecessors, (38), 19 states have call successors, (19), 10 states have call predecessors, (19), 9 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-09-12 23:46:11,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 74 transitions. [2024-09-12 23:46:11,163 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 74 transitions. Word has length 63 [2024-09-12 23:46:11,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 23:46:11,163 INFO L474 AbstractCegarLoop]: Abstraction has 66 states and 74 transitions. [2024-09-12 23:46:11,163 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.8) internal successors, (36), 17 states have internal predecessors, (36), 8 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (17), 8 states have call predecessors, (17), 8 states have call successors, (17) [2024-09-12 23:46:11,163 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 23:46:11,164 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 74 transitions. [2024-09-12 23:46:11,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-09-12 23:46:11,164 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 23:46:11,165 INFO L216 NwaCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 23:46:11,171 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-09-12 23:46:11,365 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 23:46:11,365 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 23:46:11,365 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 23:46:11,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1458632259, now seen corresponding path program 3 times [2024-09-12 23:46:11,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 23:46:11,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332322855] [2024-09-12 23:46:11,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 23:46:11,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 23:46:11,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-12 23:46:11,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [528795586] [2024-09-12 23:46:11,408 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-12 23:46:11,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 23:46:11,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 23:46:11,411 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 23:46:11,412 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-09-12 23:46:11,512 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-09-12 23:46:11,512 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 23:46:11,517 INFO L262 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-09-12 23:46:11,519 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 23:46:11,996 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-09-12 23:46:11,996 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 23:46:20,067 WARN L293 SmtUtils]: Spent 8.04s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:46:24,087 WARN L876 $PredicateComparison]: unable to prove that (= (mod (+ (* c_main_~q~0 c_main_~r~0 12 c_main_~h~0) (* c_main_~q~0 c_main_~p~0 c_main_~r~0 4294967280) (* c_main_~q~0 c_main_~q~0 4294967295 c_main_~h~0) (* c_main_~h~0 c_main_~h~0 c_main_~h~0) (* 4294967292 c_main_~q~0 c_main_~q~0 c_main_~p~0) (* c_main_~q~0 16 c_main_~p~0 c_main_~n~0) (* c_main_~q~0 c_main_~n~0 4294967284 c_main_~h~0)) 4294967296) 0) is different from true [2024-09-12 23:46:47,091 WARN L293 SmtUtils]: Spent 8.04s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:47:07,642 WARN L293 SmtUtils]: Spent 12.19s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:47:48,889 WARN L293 SmtUtils]: Spent 20.45s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-12 23:47:58,695 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 16 proven. 0 refuted. 2 times theorem prover too weak. 116 trivial. 4 not checked. [2024-09-12 23:47:58,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 23:47:58,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332322855] [2024-09-12 23:47:58,696 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-12 23:47:58,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528795586] [2024-09-12 23:47:58,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528795586] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 23:47:58,696 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-12 23:47:58,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2024-09-12 23:47:58,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044653299] [2024-09-12 23:47:58,696 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-12 23:47:58,696 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-09-12 23:47:58,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 23:47:58,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-09-12 23:47:58,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=215, Unknown=6, NotChecked=30, Total=306 [2024-09-12 23:47:58,697 INFO L87 Difference]: Start difference. First operand 66 states and 74 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 15 states have internal predecessors, (34), 6 states have call successors, (23), 3 states have call predecessors, (23), 2 states have return successors, (21), 6 states have call predecessors, (21), 6 states have call successors, (21) [2024-09-12 23:48:02,790 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2024-09-12 23:48:07,197 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] Killed by 15