./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_unwindbound2.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 --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a9b967e5 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_unwindbound2.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 ee8fbf7ad7c769bb660b4c416c89e8a6070f0c88820552e25f4a5ca5398fd5ca --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a9b967e-m [2024-09-12 18:40:58,593 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-12 18:40:58,654 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-12 18:40:58,658 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-12 18:40:58,659 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-12 18:40:58,682 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-12 18:40:58,684 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-12 18:40:58,685 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-12 18:40:58,685 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-12 18:40:58,686 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-12 18:40:58,686 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-12 18:40:58,686 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-12 18:40:58,687 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-12 18:40:58,687 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-12 18:40:58,688 INFO L153 SettingsManager]: * Use SBE=true [2024-09-12 18:40:58,689 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-12 18:40:58,689 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-12 18:40:58,689 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-12 18:40:58,689 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-12 18:40:58,689 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-12 18:40:58,689 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-12 18:40:58,692 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-12 18:40:58,693 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-12 18:40:58,693 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-12 18:40:58,693 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-12 18:40:58,693 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-12 18:40:58,693 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-12 18:40:58,693 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-12 18:40:58,694 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-12 18:40:58,694 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-12 18:40:58,694 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-12 18:40:58,694 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-12 18:40:58,694 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 18:40:58,694 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-12 18:40:58,695 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-12 18:40:58,695 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-12 18:40:58,695 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-12 18:40:58,695 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-12 18:40:58,695 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-12 18:40:58,695 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-12 18:40:58,695 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-12 18:40:58,696 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-12 18:40:58,696 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 -> ee8fbf7ad7c769bb660b4c416c89e8a6070f0c88820552e25f4a5ca5398fd5ca 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2024-09-12 18:40:58,960 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-12 18:40:58,980 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-12 18:40:58,982 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-12 18:40:58,983 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-12 18:40:58,984 INFO L274 PluginConnector]: CDTParser initialized [2024-09-12 18:40:58,984 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_unwindbound2.c [2024-09-12 18:41:00,289 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-12 18:41:00,569 INFO L384 CDTParser]: Found 1 translation units. [2024-09-12 18:41:00,570 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_unwindbound2.c [2024-09-12 18:41:00,581 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/691169016/a9a5a375054f44aab10a02a064836393/FLAGe02fedb35 [2024-09-12 18:41:00,870 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/691169016/a9a5a375054f44aab10a02a064836393 [2024-09-12 18:41:00,872 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-12 18:41:00,873 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-12 18:41:00,874 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-12 18:41:00,875 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-12 18:41:00,879 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-12 18:41:00,881 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 06:41:00" (1/1) ... [2024-09-12 18:41:00,882 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f0590dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:41:00, skipping insertion in model container [2024-09-12 18:41:00,882 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 06:41:00" (1/1) ... [2024-09-12 18:41:00,898 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-12 18:41:01,029 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_unwindbound2.c[525,538] [2024-09-12 18:41:01,058 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 18:41:01,066 INFO L200 MainTranslator]: Completed pre-run [2024-09-12 18:41:01,074 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_unwindbound2.c[525,538] [2024-09-12 18:41:01,093 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 18:41:01,109 INFO L204 MainTranslator]: Completed translation [2024-09-12 18:41:01,109 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:41:01 WrapperNode [2024-09-12 18:41:01,109 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-12 18:41:01,110 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-12 18:41:01,111 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-12 18:41:01,111 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-12 18:41:01,115 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:41:01" (1/1) ... [2024-09-12 18:41:01,119 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:41:01" (1/1) ... [2024-09-12 18:41:01,126 INFO L138 Inliner]: procedures = 14, calls = 17, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-12 18:41:01,126 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-12 18:41:01,127 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-12 18:41:01,127 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-12 18:41:01,127 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-12 18:41:01,134 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:41:01" (1/1) ... [2024-09-12 18:41:01,134 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:41:01" (1/1) ... [2024-09-12 18:41:01,140 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:41:01" (1/1) ... [2024-09-12 18:41:01,152 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 18:41:01,152 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:41:01" (1/1) ... [2024-09-12 18:41:01,152 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:41:01" (1/1) ... [2024-09-12 18:41:01,159 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:41:01" (1/1) ... [2024-09-12 18:41:01,161 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:41:01" (1/1) ... [2024-09-12 18:41:01,162 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:41:01" (1/1) ... [2024-09-12 18:41:01,162 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:41:01" (1/1) ... [2024-09-12 18:41:01,167 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-12 18:41:01,167 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-12 18:41:01,168 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-12 18:41:01,168 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-12 18:41:01,168 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:41:01" (1/1) ... [2024-09-12 18:41:01,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 18:41:01,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 18:41:01,192 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 18:41:01,198 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 18:41:01,264 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-12 18:41:01,284 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-12 18:41:01,284 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-12 18:41:01,284 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-12 18:41:01,284 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-12 18:41:01,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-12 18:41:01,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-12 18:41:01,284 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-12 18:41:01,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-12 18:41:01,284 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-12 18:41:01,285 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-12 18:41:01,285 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-12 18:41:01,342 INFO L242 CfgBuilder]: Building ICFG [2024-09-12 18:41:01,343 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-12 18:41:01,545 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-09-12 18:41:01,545 INFO L291 CfgBuilder]: Performing block encoding [2024-09-12 18:41:01,558 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-12 18:41:01,559 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-12 18:41:01,559 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 06:41:01 BoogieIcfgContainer [2024-09-12 18:41:01,559 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-12 18:41:01,560 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-12 18:41:01,561 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-12 18:41:01,563 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-12 18:41:01,563 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.09 06:41:00" (1/3) ... [2024-09-12 18:41:01,563 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@775b520 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 06:41:01, skipping insertion in model container [2024-09-12 18:41:01,563 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:41:01" (2/3) ... [2024-09-12 18:41:01,564 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@775b520 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 06:41:01, skipping insertion in model container [2024-09-12 18:41:01,564 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 06:41:01" (3/3) ... [2024-09-12 18:41:01,565 INFO L112 eAbstractionObserver]: Analyzing ICFG dijkstra-u_unwindbound2.c [2024-09-12 18:41:01,576 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-12 18:41:01,576 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-09-12 18:41:01,615 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-12 18:41:01,620 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;@3bdff079, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-12 18:41:01,620 INFO L337 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-09-12 18:41:01,622 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 23 states have (on average 1.608695652173913) internal successors, (37), 28 states have internal predecessors, (37), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-09-12 18:41:01,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-09-12 18:41:01,627 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:41:01,627 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:41:01,628 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-09-12 18:41:01,635 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:41:01,635 INFO L85 PathProgramCache]: Analyzing trace with hash -300997547, now seen corresponding path program 1 times [2024-09-12 18:41:01,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:41:01,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553800036] [2024-09-12 18:41:01,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:41:01,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:41:01,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:41:01,782 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:41:01,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:41:01,795 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 18:41:01,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:41:01,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:41:01,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:41:01,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553800036] [2024-09-12 18:41:01,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553800036] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:41:01,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:41:01,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-12 18:41:01,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061390002] [2024-09-12 18:41:01,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:41:01,811 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-12 18:41:01,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:41:01,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-12 18:41:01,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 18:41:01,831 INFO L87 Difference]: Start difference. First operand has 45 states, 23 states have (on average 1.608695652173913) internal successors, (37), 28 states have internal predecessors, (37), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-12 18:41:01,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:41:01,978 INFO L93 Difference]: Finished difference Result 87 states and 128 transitions. [2024-09-12 18:41:01,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-12 18:41:01,980 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 13 [2024-09-12 18:41:01,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:41:01,985 INFO L225 Difference]: With dead ends: 87 [2024-09-12 18:41:01,986 INFO L226 Difference]: Without dead ends: 46 [2024-09-12 18:41:01,989 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 18:41:01,992 INFO L434 NwaCegarLoop]: 45 mSDtfsCounter, 14 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 18:41:01,993 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 64 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 18:41:02,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-09-12 18:41:02,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 41. [2024-09-12 18:41:02,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 26 states have internal predecessors, (31), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-12 18:41:02,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 53 transitions. [2024-09-12 18:41:02,031 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 53 transitions. Word has length 13 [2024-09-12 18:41:02,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:41:02,031 INFO L474 AbstractCegarLoop]: Abstraction has 41 states and 53 transitions. [2024-09-12 18:41:02,031 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-12 18:41:02,032 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:41:02,032 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 53 transitions. [2024-09-12 18:41:02,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-09-12 18:41:02,033 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:41:02,033 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:41:02,033 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-12 18:41:02,033 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-09-12 18:41:02,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:41:02,034 INFO L85 PathProgramCache]: Analyzing trace with hash -243739245, now seen corresponding path program 1 times [2024-09-12 18:41:02,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:41:02,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858312911] [2024-09-12 18:41:02,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:41:02,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:41:02,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:41:02,113 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:41:02,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:41:02,124 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 18:41:02,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:41:02,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:41:02,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:41:02,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858312911] [2024-09-12 18:41:02,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858312911] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:41:02,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:41:02,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-12 18:41:02,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267997184] [2024-09-12 18:41:02,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:41:02,134 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 18:41:02,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:41:02,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 18:41:02,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 18:41:02,135 INFO L87 Difference]: Start difference. First operand 41 states and 53 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-12 18:41:06,206 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 18:41:10,222 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 18:41:14,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 18:41:14,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:41:14,536 INFO L93 Difference]: Finished difference Result 70 states and 93 transitions. [2024-09-12 18:41:14,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-12 18:41:14,536 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 13 [2024-09-12 18:41:14,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:41:14,537 INFO L225 Difference]: With dead ends: 70 [2024-09-12 18:41:14,537 INFO L226 Difference]: Without dead ends: 45 [2024-09-12 18:41:14,538 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-09-12 18:41:14,538 INFO L434 NwaCegarLoop]: 39 mSDtfsCounter, 19 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 15 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.4s IncrementalHoareTripleChecker+Time [2024-09-12 18:41:14,539 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 107 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 69 Invalid, 3 Unknown, 0 Unchecked, 12.4s Time] [2024-09-12 18:41:14,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-09-12 18:41:14,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-09-12 18:41:14,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 25 states have (on average 1.4) internal successors, (35), 30 states have internal predecessors, (35), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-12 18:41:14,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 57 transitions. [2024-09-12 18:41:14,564 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 57 transitions. Word has length 13 [2024-09-12 18:41:14,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:41:14,564 INFO L474 AbstractCegarLoop]: Abstraction has 45 states and 57 transitions. [2024-09-12 18:41:14,564 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-12 18:41:14,564 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:41:14,564 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 57 transitions. [2024-09-12 18:41:14,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-09-12 18:41:14,565 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:41:14,565 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:41:14,565 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-12 18:41:14,565 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-09-12 18:41:14,565 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:41:14,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1347328248, now seen corresponding path program 1 times [2024-09-12 18:41:14,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:41:14,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851719662] [2024-09-12 18:41:14,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:41:14,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:41:14,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:41:14,723 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:41:14,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:41:14,731 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 18:41:14,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:41:14,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:41:14,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:41:14,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851719662] [2024-09-12 18:41:14,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851719662] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:41:14,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:41:14,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-12 18:41:14,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552859463] [2024-09-12 18:41:14,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:41:14,738 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-12 18:41:14,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:41:14,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-12 18:41:14,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-09-12 18:41:14,739 INFO L87 Difference]: Start difference. First operand 45 states and 57 transitions. Second operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-12 18:41:18,898 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 18:41:18,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:41:18,993 INFO L93 Difference]: Finished difference Result 74 states and 97 transitions. [2024-09-12 18:41:18,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-12 18:41:18,993 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2024-09-12 18:41:18,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:41:18,994 INFO L225 Difference]: With dead ends: 74 [2024-09-12 18:41:18,995 INFO L226 Difference]: Without dead ends: 73 [2024-09-12 18:41:18,995 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-09-12 18:41:18,996 INFO L434 NwaCegarLoop]: 27 mSDtfsCounter, 52 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 23 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-09-12 18:41:18,996 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 125 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 169 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2024-09-12 18:41:18,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-09-12 18:41:19,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 65. [2024-09-12 18:41:19,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 35 states have (on average 1.457142857142857) internal successors, (51), 41 states have internal predecessors, (51), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-09-12 18:41:19,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 90 transitions. [2024-09-12 18:41:19,012 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 90 transitions. Word has length 18 [2024-09-12 18:41:19,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:41:19,012 INFO L474 AbstractCegarLoop]: Abstraction has 65 states and 90 transitions. [2024-09-12 18:41:19,012 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-12 18:41:19,013 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:41:19,013 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 90 transitions. [2024-09-12 18:41:19,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-09-12 18:41:19,015 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:41:19,015 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:41:19,015 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-12 18:41:19,015 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-09-12 18:41:19,015 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:41:19,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1347326998, now seen corresponding path program 1 times [2024-09-12 18:41:19,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:41:19,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268622625] [2024-09-12 18:41:19,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:41:19,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:41:19,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:41:19,111 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:41:19,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:41:19,117 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 18:41:19,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:41:19,122 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:41:19,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:41:19,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268622625] [2024-09-12 18:41:19,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268622625] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 18:41:19,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [283636333] [2024-09-12 18:41:19,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:41:19,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:41:19,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 18:41:19,124 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 18:41:19,137 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 18:41:19,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:41:19,176 INFO L262 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-12 18:41:19,180 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:41:19,282 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:41:19,283 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 18:41:19,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [283636333] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:41:19,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-12 18:41:19,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2024-09-12 18:41:19,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802179340] [2024-09-12 18:41:19,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:41:19,284 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 18:41:19,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:41:19,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 18:41:19,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-09-12 18:41:19,285 INFO L87 Difference]: Start difference. First operand 65 states and 90 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-12 18:41:19,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:41:19,358 INFO L93 Difference]: Finished difference Result 73 states and 99 transitions. [2024-09-12 18:41:19,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-12 18:41:19,358 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2024-09-12 18:41:19,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:41:19,359 INFO L225 Difference]: With dead ends: 73 [2024-09-12 18:41:19,359 INFO L226 Difference]: Without dead ends: 72 [2024-09-12 18:41:19,360 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2024-09-12 18:41:19,360 INFO L434 NwaCegarLoop]: 44 mSDtfsCounter, 14 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 18:41:19,361 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 157 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 18:41:19,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-09-12 18:41:19,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 64. [2024-09-12 18:41:19,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 40 states have internal predecessors, (50), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-09-12 18:41:19,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 89 transitions. [2024-09-12 18:41:19,370 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 89 transitions. Word has length 18 [2024-09-12 18:41:19,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:41:19,370 INFO L474 AbstractCegarLoop]: Abstraction has 64 states and 89 transitions. [2024-09-12 18:41:19,371 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-12 18:41:19,371 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:41:19,371 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 89 transitions. [2024-09-12 18:41:19,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-12 18:41:19,371 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:41:19,372 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:41:19,384 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 18:41:19,575 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:41:19,576 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-09-12 18:41:19,576 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:41:19,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1182497347, now seen corresponding path program 1 times [2024-09-12 18:41:19,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:41:19,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222888882] [2024-09-12 18:41:19,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:41:19,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:41:19,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:41:19,687 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:41:19,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:41:19,692 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 18:41:19,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:41:19,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:41:19,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:41:19,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222888882] [2024-09-12 18:41:19,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222888882] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:41:19,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:41:19,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-12 18:41:19,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624848309] [2024-09-12 18:41:19,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:41:19,701 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-12 18:41:19,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:41:19,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-12 18:41:19,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-09-12 18:41:19,702 INFO L87 Difference]: Start difference. First operand 64 states and 89 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-12 18:41:19,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:41:19,850 INFO L93 Difference]: Finished difference Result 82 states and 109 transitions. [2024-09-12 18:41:19,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-12 18:41:19,851 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2024-09-12 18:41:19,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:41:19,851 INFO L225 Difference]: With dead ends: 82 [2024-09-12 18:41:19,852 INFO L226 Difference]: Without dead ends: 72 [2024-09-12 18:41:19,852 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-09-12 18:41:19,852 INFO L434 NwaCegarLoop]: 34 mSDtfsCounter, 30 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 18:41:19,853 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 125 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 18:41:19,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-09-12 18:41:19,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2024-09-12 18:41:19,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 44 states have internal predecessors, (54), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-09-12 18:41:19,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 93 transitions. [2024-09-12 18:41:19,866 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 93 transitions. Word has length 19 [2024-09-12 18:41:19,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:41:19,866 INFO L474 AbstractCegarLoop]: Abstraction has 68 states and 93 transitions. [2024-09-12 18:41:19,867 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-12 18:41:19,867 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:41:19,867 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 93 transitions. [2024-09-12 18:41:19,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-12 18:41:19,867 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:41:19,867 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:41:19,867 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-12 18:41:19,867 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-09-12 18:41:19,868 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:41:19,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1182536076, now seen corresponding path program 1 times [2024-09-12 18:41:19,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:41:19,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568153153] [2024-09-12 18:41:19,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:41:19,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:41:19,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:41:19,929 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:41:19,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:41:19,934 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 18:41:19,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:41:19,937 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:41:19,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:41:19,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568153153] [2024-09-12 18:41:19,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568153153] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 18:41:19,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [903048475] [2024-09-12 18:41:19,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:41:19,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:41:19,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 18:41:19,941 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 18:41:19,944 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 18:41:19,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:41:19,973 INFO L262 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-12 18:41:19,974 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:41:20,039 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:41:20,040 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 18:41:20,116 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:41:20,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [903048475] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 18:41:20,116 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 18:41:20,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 13 [2024-09-12 18:41:20,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831294265] [2024-09-12 18:41:20,116 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 18:41:20,117 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-09-12 18:41:20,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:41:20,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-09-12 18:41:20,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2024-09-12 18:41:20,118 INFO L87 Difference]: Start difference. First operand 68 states and 93 transitions. Second operand has 14 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2024-09-12 18:41:20,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:41:20,396 INFO L93 Difference]: Finished difference Result 115 states and 156 transitions. [2024-09-12 18:41:20,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-12 18:41:20,397 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) Word has length 19 [2024-09-12 18:41:20,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:41:20,398 INFO L225 Difference]: With dead ends: 115 [2024-09-12 18:41:20,398 INFO L226 Difference]: Without dead ends: 91 [2024-09-12 18:41:20,398 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=126, Invalid=294, Unknown=0, NotChecked=0, Total=420 [2024-09-12 18:41:20,399 INFO L434 NwaCegarLoop]: 36 mSDtfsCounter, 58 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 18:41:20,399 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 199 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 18:41:20,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-09-12 18:41:20,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 81. [2024-09-12 18:41:20,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 52 states have (on average 1.3461538461538463) internal successors, (70), 57 states have internal predecessors, (70), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-09-12 18:41:20,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 109 transitions. [2024-09-12 18:41:20,408 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 109 transitions. Word has length 19 [2024-09-12 18:41:20,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:41:20,408 INFO L474 AbstractCegarLoop]: Abstraction has 81 states and 109 transitions. [2024-09-12 18:41:20,408 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2024-09-12 18:41:20,409 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:41:20,409 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 109 transitions. [2024-09-12 18:41:20,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-09-12 18:41:20,409 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:41:20,409 INFO L216 NwaCegarLoop]: trace histogram [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 18:41:20,423 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 18:41:20,610 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-12 18:41:20,610 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-09-12 18:41:20,610 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:41:20,611 INFO L85 PathProgramCache]: Analyzing trace with hash 882267423, now seen corresponding path program 1 times [2024-09-12 18:41:20,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:41:20,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917809906] [2024-09-12 18:41:20,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:41:20,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:41:20,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:41:20,779 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:41:20,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:41:20,781 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 18:41:20,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:41:20,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:41:20,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:41:20,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917809906] [2024-09-12 18:41:20,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917809906] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:41:20,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:41:20,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-12 18:41:20,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129349056] [2024-09-12 18:41:20,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:41:20,788 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-12 18:41:20,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:41:20,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-12 18:41:20,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-09-12 18:41:20,789 INFO L87 Difference]: Start difference. First operand 81 states and 109 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-12 18:41:21,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:41:21,854 INFO L93 Difference]: Finished difference Result 102 states and 137 transitions. [2024-09-12 18:41:21,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-12 18:41:21,855 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2024-09-12 18:41:21,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:41:21,855 INFO L225 Difference]: With dead ends: 102 [2024-09-12 18:41:21,856 INFO L226 Difference]: Without dead ends: 80 [2024-09-12 18:41:21,856 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-09-12 18:41:21,856 INFO L434 NwaCegarLoop]: 37 mSDtfsCounter, 23 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-09-12 18:41:21,857 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 152 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-09-12 18:41:21,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-09-12 18:41:21,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-09-12 18:41:21,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 50 states have (on average 1.28) internal successors, (64), 55 states have internal predecessors, (64), 21 states have call successors, (21), 6 states have call predecessors, (21), 5 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-09-12 18:41:21,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 103 transitions. [2024-09-12 18:41:21,867 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 103 transitions. Word has length 24 [2024-09-12 18:41:21,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:41:21,868 INFO L474 AbstractCegarLoop]: Abstraction has 80 states and 103 transitions. [2024-09-12 18:41:21,868 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-12 18:41:21,868 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:41:21,868 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 103 transitions. [2024-09-12 18:41:21,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-09-12 18:41:21,868 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:41:21,869 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:41:21,869 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-12 18:41:21,869 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-09-12 18:41:21,869 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:41:21,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1612959983, now seen corresponding path program 1 times [2024-09-12 18:41:21,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:41:21,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37268952] [2024-09-12 18:41:21,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:41:21,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:41:21,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:41:21,959 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:41:21,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:41:21,966 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 18:41:21,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:41:21,975 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:41:21,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:41:21,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37268952] [2024-09-12 18:41:21,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37268952] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 18:41:21,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25157172] [2024-09-12 18:41:21,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:41:21,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:41:21,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 18:41:21,980 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 18:41:21,981 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 18:41:22,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:41:22,012 INFO L262 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-12 18:41:22,013 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:41:22,094 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:41:22,095 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 18:41:22,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [25157172] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:41:22,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-12 18:41:22,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 11 [2024-09-12 18:41:22,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189760245] [2024-09-12 18:41:22,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:41:22,095 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-12 18:41:22,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:41:22,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-12 18:41:22,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-09-12 18:41:22,096 INFO L87 Difference]: Start difference. First operand 80 states and 103 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-12 18:41:22,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:41:22,246 INFO L93 Difference]: Finished difference Result 96 states and 121 transitions. [2024-09-12 18:41:22,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-12 18:41:22,247 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2024-09-12 18:41:22,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:41:22,248 INFO L225 Difference]: With dead ends: 96 [2024-09-12 18:41:22,248 INFO L226 Difference]: Without dead ends: 73 [2024-09-12 18:41:22,249 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2024-09-12 18:41:22,249 INFO L434 NwaCegarLoop]: 45 mSDtfsCounter, 30 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 18:41:22,249 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 265 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 18:41:22,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-09-12 18:41:22,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2024-09-12 18:41:22,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 48 states have (on average 1.2083333333333333) internal successors, (58), 52 states have internal predecessors, (58), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-09-12 18:41:22,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 85 transitions. [2024-09-12 18:41:22,268 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 85 transitions. Word has length 23 [2024-09-12 18:41:22,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:41:22,268 INFO L474 AbstractCegarLoop]: Abstraction has 71 states and 85 transitions. [2024-09-12 18:41:22,268 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-12 18:41:22,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:41:22,269 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 85 transitions. [2024-09-12 18:41:22,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-09-12 18:41:22,276 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:41:22,276 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] [2024-09-12 18:41:22,296 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-09-12 18:41:22,477 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-09-12 18:41:22,478 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-09-12 18:41:22,478 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:41:22,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1537848154, now seen corresponding path program 1 times [2024-09-12 18:41:22,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:41:22,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602149698] [2024-09-12 18:41:22,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:41:22,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:41:22,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:41:22,571 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:41:22,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:41:22,577 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 18:41:22,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:41:22,581 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:41:22,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:41:22,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602149698] [2024-09-12 18:41:22,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602149698] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 18:41:22,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1806683351] [2024-09-12 18:41:22,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:41:22,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:41:22,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 18:41:22,587 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 18:41:22,591 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 18:41:22,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:41:22,620 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-12 18:41:22,621 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:41:22,684 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:41:22,685 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 18:41:22,796 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:41:22,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1806683351] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 18:41:22,796 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 18:41:22,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 17 [2024-09-12 18:41:22,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982925156] [2024-09-12 18:41:22,797 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 18:41:22,797 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-09-12 18:41:22,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:41:22,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-09-12 18:41:22,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2024-09-12 18:41:22,798 INFO L87 Difference]: Start difference. First operand 71 states and 85 transitions. Second operand has 18 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2024-09-12 18:41:27,406 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 18:41:31,460 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 18:41:31,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:41:31,518 INFO L93 Difference]: Finished difference Result 97 states and 116 transitions. [2024-09-12 18:41:31,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-09-12 18:41:31,518 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) Word has length 24 [2024-09-12 18:41:31,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:41:31,519 INFO L225 Difference]: With dead ends: 97 [2024-09-12 18:41:31,519 INFO L226 Difference]: Without dead ends: 96 [2024-09-12 18:41:31,519 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=222, Invalid=770, Unknown=0, NotChecked=0, Total=992 [2024-09-12 18:41:31,520 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 94 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 20 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2024-09-12 18:41:31,520 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 131 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 267 Invalid, 2 Unknown, 0 Unchecked, 8.6s Time] [2024-09-12 18:41:31,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-09-12 18:41:31,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 76. [2024-09-12 18:41:31,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 53 states have (on average 1.2264150943396226) internal successors, (65), 57 states have internal predecessors, (65), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-09-12 18:41:31,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 92 transitions. [2024-09-12 18:41:31,542 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 92 transitions. Word has length 24 [2024-09-12 18:41:31,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:41:31,545 INFO L474 AbstractCegarLoop]: Abstraction has 76 states and 92 transitions. [2024-09-12 18:41:31,546 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2024-09-12 18:41:31,546 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:41:31,546 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 92 transitions. [2024-09-12 18:41:31,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-09-12 18:41:31,546 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:41:31,547 INFO L216 NwaCegarLoop]: trace histogram [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 18:41:31,558 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-12 18:41:31,747 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:41:31,747 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-09-12 18:41:31,748 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:41:31,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1872928402, now seen corresponding path program 1 times [2024-09-12 18:41:31,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:41:31,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351942793] [2024-09-12 18:41:31,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:41:31,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:41:31,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-12 18:41:31,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [709301218] [2024-09-12 18:41:31,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:41:31,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:41:31,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 18:41:31,772 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 18:41:31,775 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 18:41:31,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:41:31,810 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-12 18:41:31,811 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:41:31,947 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:41:31,947 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 18:41:31,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:41:31,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351942793] [2024-09-12 18:41:31,948 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-12 18:41:31,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709301218] [2024-09-12 18:41:31,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [709301218] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:41:31,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:41:31,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-12 18:41:31,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640045279] [2024-09-12 18:41:31,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:41:31,949 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 18:41:31,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:41:31,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 18:41:31,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-09-12 18:41:31,950 INFO L87 Difference]: Start difference. First operand 76 states and 92 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-12 18:41:32,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:41:32,079 INFO L93 Difference]: Finished difference Result 82 states and 97 transitions. [2024-09-12 18:41:32,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 18:41:32,080 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2024-09-12 18:41:32,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:41:32,080 INFO L225 Difference]: With dead ends: 82 [2024-09-12 18:41:32,080 INFO L226 Difference]: Without dead ends: 80 [2024-09-12 18:41:32,081 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-09-12 18:41:32,081 INFO L434 NwaCegarLoop]: 37 mSDtfsCounter, 3 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 18:41:32,081 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 139 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 18:41:32,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-09-12 18:41:32,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-09-12 18:41:32,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 56 states have (on average 1.2142857142857142) internal successors, (68), 60 states have internal predecessors, (68), 15 states have call successors, (15), 7 states have call predecessors, (15), 6 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-09-12 18:41:32,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 95 transitions. [2024-09-12 18:41:32,091 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 95 transitions. Word has length 29 [2024-09-12 18:41:32,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:41:32,091 INFO L474 AbstractCegarLoop]: Abstraction has 80 states and 95 transitions. [2024-09-12 18:41:32,091 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-12 18:41:32,091 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:41:32,091 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 95 transitions. [2024-09-12 18:41:32,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-09-12 18:41:32,092 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:41:32,092 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, 1, 1, 1, 1] [2024-09-12 18:41:32,105 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-09-12 18:41:32,292 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-09-12 18:41:32,293 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-09-12 18:41:32,294 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:41:32,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1752401958, now seen corresponding path program 1 times [2024-09-12 18:41:32,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:41:32,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972132143] [2024-09-12 18:41:32,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:41:32,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:41:32,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-12 18:41:32,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [954346519] [2024-09-12 18:41:32,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:41:32,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:41:32,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 18:41:32,307 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 18:41:32,308 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 18:41:32,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:41:32,338 INFO L262 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-12 18:41:32,343 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:41:32,402 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-09-12 18:41:32,402 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 18:41:32,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:41:32,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972132143] [2024-09-12 18:41:32,402 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-12 18:41:32,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954346519] [2024-09-12 18:41:32,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954346519] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:41:32,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:41:32,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 18:41:32,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204171581] [2024-09-12 18:41:32,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:41:32,403 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 18:41:32,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:41:32,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 18:41:32,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 18:41:32,403 INFO L87 Difference]: Start difference. First operand 80 states and 95 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-12 18:41:32,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:41:32,469 INFO L93 Difference]: Finished difference Result 94 states and 107 transitions. [2024-09-12 18:41:32,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 18:41:32,470 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2024-09-12 18:41:32,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:41:32,471 INFO L225 Difference]: With dead ends: 94 [2024-09-12 18:41:32,471 INFO L226 Difference]: Without dead ends: 86 [2024-09-12 18:41:32,471 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 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 18:41:32,472 INFO L434 NwaCegarLoop]: 45 mSDtfsCounter, 8 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 18:41:32,472 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 144 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 18:41:32,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-09-12 18:41:32,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 83. [2024-09-12 18:41:32,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 61 states have (on average 1.1639344262295082) internal successors, (71), 64 states have internal predecessors, (71), 12 states have call successors, (12), 9 states have call predecessors, (12), 7 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-12 18:41:32,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 93 transitions. [2024-09-12 18:41:32,481 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 93 transitions. Word has length 29 [2024-09-12 18:41:32,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:41:32,482 INFO L474 AbstractCegarLoop]: Abstraction has 83 states and 93 transitions. [2024-09-12 18:41:32,482 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-12 18:41:32,482 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:41:32,482 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 93 transitions. [2024-09-12 18:41:32,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-09-12 18:41:32,483 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:41:32,483 INFO L216 NwaCegarLoop]: trace histogram [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] [2024-09-12 18:41:32,495 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 18:41:32,683 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-09-12 18:41:32,684 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-09-12 18:41:32,685 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:41:32,685 INFO L85 PathProgramCache]: Analyzing trace with hash -608876013, now seen corresponding path program 1 times [2024-09-12 18:41:32,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:41:32,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178839943] [2024-09-12 18:41:32,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:41:32,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:41:32,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-12 18:41:32,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [564769293] [2024-09-12 18:41:32,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:41:32,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:41:32,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 18:41:32,696 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 18:41:32,703 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 18:41:32,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:41:32,735 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-12 18:41:32,736 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:41:32,799 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-09-12 18:41:32,799 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 18:41:32,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:41:32,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178839943] [2024-09-12 18:41:32,809 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-12 18:41:32,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [564769293] [2024-09-12 18:41:32,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [564769293] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:41:32,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:41:32,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 18:41:32,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128922392] [2024-09-12 18:41:32,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:41:32,810 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 18:41:32,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:41:32,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 18:41:32,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 18:41:32,810 INFO L87 Difference]: Start difference. First operand 83 states and 93 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-12 18:41:36,835 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 18:41:36,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:41:36,892 INFO L93 Difference]: Finished difference Result 83 states and 93 transitions. [2024-09-12 18:41:36,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 18:41:36,892 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 34 [2024-09-12 18:41:36,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:41:36,893 INFO L225 Difference]: With dead ends: 83 [2024-09-12 18:41:36,893 INFO L226 Difference]: Without dead ends: 41 [2024-09-12 18:41:36,893 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 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 18:41:36,894 INFO L434 NwaCegarLoop]: 38 mSDtfsCounter, 8 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-09-12 18:41:36,894 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 122 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2024-09-12 18:41:36,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-09-12 18:41:36,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-09-12 18:41:36,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 34 states have (on average 1.088235294117647) internal successors, (37), 35 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-12 18:41:36,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2024-09-12 18:41:36,899 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 34 [2024-09-12 18:41:36,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:41:36,899 INFO L474 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2024-09-12 18:41:36,899 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-12 18:41:36,899 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:41:36,899 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2024-09-12 18:41:36,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-09-12 18:41:36,900 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:41:36,900 INFO L216 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:41:36,914 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-09-12 18:41:37,104 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:41:37,105 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-09-12 18:41:37,105 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:41:37,106 INFO L85 PathProgramCache]: Analyzing trace with hash -21090237, now seen corresponding path program 2 times [2024-09-12 18:41:37,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:41:37,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531609592] [2024-09-12 18:41:37,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:41:37,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:41:37,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:41:37,220 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:41:37,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:41:37,224 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 18:41:37,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:41:37,228 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 29 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-12 18:41:37,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:41:37,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531609592] [2024-09-12 18:41:37,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531609592] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 18:41:37,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273521268] [2024-09-12 18:41:37,229 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-12 18:41:37,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:41:37,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 18:41:37,232 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 18:41:37,236 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-09-12 18:41:37,270 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-12 18:41:37,270 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 18:41:37,271 INFO L262 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-12 18:41:37,271 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:41:37,330 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 36 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-12 18:41:37,330 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 18:41:37,411 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 36 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-12 18:41:37,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1273521268] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 18:41:37,411 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 18:41:37,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 12 [2024-09-12 18:41:37,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376728704] [2024-09-12 18:41:37,412 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 18:41:37,412 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-12 18:41:37,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:41:37,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-12 18:41:37,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-09-12 18:41:37,413 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-09-12 18:41:37,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:41:37,503 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2024-09-12 18:41:37,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-12 18:41:37,503 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 34 [2024-09-12 18:41:37,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:41:37,503 INFO L225 Difference]: With dead ends: 41 [2024-09-12 18:41:37,504 INFO L226 Difference]: Without dead ends: 0 [2024-09-12 18:41:37,505 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 65 SyntacticMatches, 6 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-09-12 18:41:37,505 INFO L434 NwaCegarLoop]: 8 mSDtfsCounter, 18 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 18:41:37,505 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 29 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 18:41:37,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-12 18:41:37,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-12 18:41:37,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-12 18:41:37,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-12 18:41:37,506 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 34 [2024-09-12 18:41:37,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:41:37,506 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-12 18:41:37,506 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-09-12 18:41:37,506 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:41:37,506 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-12 18:41:37,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-12 18:41:37,509 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 5 remaining) [2024-09-12 18:41:37,509 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 5 remaining) [2024-09-12 18:41:37,509 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 5 remaining) [2024-09-12 18:41:37,509 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 5 remaining) [2024-09-12 18:41:37,510 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2024-09-12 18:41:37,522 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-09-12 18:41:37,713 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,9 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:41:37,716 INFO L408 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:41:37,718 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-12 18:41:39,079 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-12 18:41:39,091 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.09 06:41:39 BoogieIcfgContainer [2024-09-12 18:41:39,091 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-12 18:41:39,092 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-12 18:41:39,092 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-12 18:41:39,092 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-12 18:41:39,092 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 06:41:01" (3/4) ... [2024-09-12 18:41:39,093 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-12 18:41:39,096 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2024-09-12 18:41:39,096 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-09-12 18:41:39,096 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2024-09-12 18:41:39,096 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-09-12 18:41:39,098 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-09-12 18:41:39,099 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-09-12 18:41:39,099 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-09-12 18:41:39,100 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-09-12 18:41:39,122 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((p == 0) && (n == r)) && (counter == 1)) && (h == 0)) || (((((p == 0) && (n == r)) && (counter == 0)) && (h == 0)) && (q == 1))) || ((((p == 0) && (n == r)) && (h == 0)) && (counter == 2))) && (\old(counter) == 0)) [2024-09-12 18:41:39,123 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\old(counter) == 0) && (((((((p == 0) && (n == r)) && (counter == 1)) && (h == 0)) && (q == 1)) && (r <= ((r / 4294967296) * 4294967296))) || (((((2 <= counter) && (p == 0)) && (n == r)) && (h == 0)) && (counter <= 2147483646)))) [2024-09-12 18:41:39,168 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.graphml [2024-09-12 18:41:39,168 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-12 18:41:39,168 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-12 18:41:39,169 INFO L158 Benchmark]: Toolchain (without parser) took 38295.57ms. Allocated memory is still 73.4MB. Free memory was 50.3MB in the beginning and 16.4MB in the end (delta: 33.9MB). Peak memory consumption was 35.3MB. Max. memory is 16.1GB. [2024-09-12 18:41:39,169 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 56.6MB. Free memory was 32.8MB in the beginning and 32.8MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-12 18:41:39,169 INFO L158 Benchmark]: CACSL2BoogieTranslator took 235.23ms. Allocated memory is still 73.4MB. Free memory was 50.1MB in the beginning and 37.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-12 18:41:39,169 INFO L158 Benchmark]: Boogie Procedure Inliner took 16.14ms. Allocated memory is still 73.4MB. Free memory was 37.5MB in the beginning and 36.5MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-12 18:41:39,170 INFO L158 Benchmark]: Boogie Preprocessor took 40.19ms. Allocated memory is still 73.4MB. Free memory was 36.5MB in the beginning and 34.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-12 18:41:39,170 INFO L158 Benchmark]: RCFGBuilder took 391.89ms. Allocated memory is still 73.4MB. Free memory was 34.7MB in the beginning and 39.2MB in the end (delta: -4.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-09-12 18:41:39,170 INFO L158 Benchmark]: TraceAbstraction took 37530.78ms. Allocated memory is still 73.4MB. Free memory was 38.5MB in the beginning and 21.3MB in the end (delta: 17.2MB). Peak memory consumption was 23.2MB. Max. memory is 16.1GB. [2024-09-12 18:41:39,170 INFO L158 Benchmark]: Witness Printer took 76.73ms. Allocated memory is still 73.4MB. Free memory was 21.3MB in the beginning and 16.4MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-12 18:41:39,171 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 56.6MB. Free memory was 32.8MB in the beginning and 32.8MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 235.23ms. Allocated memory is still 73.4MB. Free memory was 50.1MB in the beginning and 37.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 16.14ms. Allocated memory is still 73.4MB. Free memory was 37.5MB in the beginning and 36.5MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 40.19ms. Allocated memory is still 73.4MB. Free memory was 36.5MB in the beginning and 34.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 391.89ms. Allocated memory is still 73.4MB. Free memory was 34.7MB in the beginning and 39.2MB in the end (delta: -4.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * TraceAbstraction took 37530.78ms. Allocated memory is still 73.4MB. Free memory was 38.5MB in the beginning and 21.3MB in the end (delta: 17.2MB). Peak memory consumption was 23.2MB. Max. memory is 16.1GB. * Witness Printer took 76.73ms. Allocated memory is still 73.4MB. Free memory was 21.3MB in the beginning and 16.4MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 45 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 36.1s, OverallIterations: 13, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 31.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 7 mSolverCounterUnknown, 408 SdHoareTripleChecker+Valid, 30.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 371 mSDsluCounter, 1759 SdHoareTripleChecker+Invalid, 30.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1304 mSDsCounter, 154 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1281 IncrementalHoareTripleChecker+Invalid, 1442 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 154 mSolverCounterUnsat, 455 mSDtfsCounter, 1281 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 437 GetRequests, 294 SyntacticMatches, 6 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 447 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=83occurred in iteration=11, InterpolantAutomatonStates: 124, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 60 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 507 NumberOfCodeBlocks, 507 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 471 ConstructedInterpolants, 0 QuantifiedInterpolants, 1517 SizeOfPredicates, 29 NumberOfNonLiveVariables, 640 ConjunctsInSsa, 65 ConjunctsInUnsatCore, 21 InterpolantComputations, 10 PerfectInterpolantSequences, 135/178 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 5 specifications checked. All of them hold - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: ((\old(counter) == 0) && (((((((p == 0) && (n == r)) && (counter == 1)) && (h == 0)) && (q == 1)) && (r <= ((r / 4294967296) * 4294967296))) || (((((2 <= counter) && (p == 0)) && (n == r)) && (h == 0)) && (counter <= 2147483646)))) - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (((((((p == 0) && (n == r)) && (counter == 1)) && (h == 0)) || (((((p == 0) && (n == r)) && (counter == 0)) && (h == 0)) && (q == 1))) || ((((p == 0) && (n == r)) && (h == 0)) && (counter == 2))) && (\old(counter) == 0)) - ProcedureContractResult [Line: 8]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: (counter == 0) Ensures: (counter == 0) - ProcedureContractResult [Line: 20]: Procedure Contract for main Derived contract for procedure main. Requires: (counter == 0) Ensures: (\old(counter) == 0) - ProcedureContractResult [Line: 11]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: ((1 <= counter) && (1 <= \old(cond))) Ensures: ((2 <= counter) && (1 <= \old(cond))) RESULT: Ultimate proved your program to be correct! [2024-09-12 18:41:39,229 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE